The number of binary rotation words
نویسندگان
چکیده
منابع مشابه
The number of binary rotation words
We consider binary rotation words generated by partitions of the unit circle to two intervals and give a precise formula for the number of such words of length n. We also give the precise asymptotics for it, which happens to be Θ(n). The result continues the line initiated by the formula for the number of all Sturmian words obtained by Lipatov [Problemy Kibernet. 39 (1982) 67–84], then independ...
متن کاملThe Number of Positions Starting a Square in Binary Words
We consider the number σ(w) of positions that do not start a square in binary words w. Letting σ(n) denote the maximum of σ(w) for length |w| = n, we show that limσ(n)/n = 15/31. 1 Square-free positions and strong words Every binary word with at least 4 letters contains a square. A.S. Fraenkel and J. Simpson [2, 1] studied the number of distinct squares in binary word; see also Ilie [4], where ...
متن کاملOn the number of frames in binary words
A frame is a square uu, where u is an unbordered word. Let F (n) denote the maximum number of distinct frames in a binary word of length n. We count this number for small values of n and show that F (n) is at most bn/2c + 8 for all n and greater than 7n/30− for any positive and infinitely many n. We also show that Fibonacci words, which are known to contain plenty of distinct squares, have only...
متن کاملOn the number of α - power - free binary words for 2 < α ≤ 7 / 3
We study the number uα(n) of α-power-free binary words of length n, and the asymptotics of this number when n tends to infinity, for a fixed rational number α in (2, 7/3]. For any such α, we prove a structure result that allows us to describe constructively the sequence uα(n) as a 2-regular sequence. This provides an algorithm that computes the number uα(n) in logarithmic time, for fixed α. The...
متن کاملPeriods and Binary Words
We give an elementary short proof for a well-known theorem of Guibas and Odlyzko stating that the sets of periods of words are independent of the alphabet size. As a consequence of our constructing proof, we give a linear time algorithm which, given a word, computes a binary one with the same periods. We give also a very short proof for the famous Fine and Wilf's periodicity lemma.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: RAIRO - Theoretical Informatics and Applications
سال: 2014
ISSN: 0988-3754,1290-385X
DOI: 10.1051/ita/2014019